Euclidean Distance Transform of Digital Images in Arbitrary Dimensions
نویسندگان
چکیده
A new algorithm for Euclidean distance transform is proposed in this paper. It propagates from the boundary to the inner of object layer by layer, like the inverse propagation of water wave. It can be applied in every dimensional space and has linear time complexity. Euclidean distance transformations of digital images in 2-D and 3-D are conducted in the experiments. Voronoi diagram and Delaunay triangulation can also be produced by this method.
منابع مشابه
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Euclidean distance transform (EDT) of a binary image in arbitrary dimensions. The PBEDT is based on independent scan and implemented in a recursive way, i.e., the EDT of a d-dimensional image is able to be computed from the EDTs of its ðd 1Þ-dimensional sub-images. In each recursion, all of the rows i...
متن کاملA Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions
A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxelsN. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the Lp and chamfer metrics. At each dimen...
متن کاملDisguised Face Recognition by Using Local Phase Quantization and Singular Value Decomposition
Disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. Therefore, in this paper a disguised face recognition algorithm based on Local Phase Quantization (LPQ) method and Singular Value Decomposition (SVD) is presented which deals with two main challenges. The first challenge is when an individual intentionally alters the appearance ...
متن کاملNew sequential exact Euclidean distance transform algorithms based on convex analysis
We present several sequential exact Euclidean distance transform algorithms. The algorithms are based on fundamental transforms of convex analysis: The Legendre Conjugate or Legendre–Fenchel transform, and the Moreau envelope or Moreau-Yosida approximate. They combine the separability of the Euclidean distance with convex properties to achieve an optimal linear-time complexity. We compare them ...
متن کاملAnti-aliased Euclidean distance transform
We present a modified distance measure for use with distance transforms of anti-aliased, area sampled grayscale images of arbitrary binary contours. The modified measure can be used in any vector-propagation Euclidean distance transform. Our test implementation in the traditional SSED8 algorithm shows a considerable improvement in accuracy and homogeneity of the distance field compared to a tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006